public class HashBuck2<K,V> {

    static class Node<K,V> {
         public K key;
         public V value;
         public Node<K,V> next;
         public Node(K key,V value) {
              this.key = key;
              this.value = value;
         }
    }

    public Node<K,V>[] array = new Node[10];
    public int usedSize;


    public void put(K key,V value) {
        int hashCode = key.hashCode();
        int index = hashCode / array.length;
        Node<K,V> cur = array[index];
        while (cur != null) {
            if (cur.key.equals(key)) {
                cur.value = value;
            }
            cur  = cur.next;
        }

        Node<K,V> node = new Node<>(key,value);
        node.next = array[index];
        array[index] = node;
        usedSize++;

    }

    public V get(K key) {
        int hashCode = key.hashCode();
        int index = hashCode / array.length;
        Node<K,V> cur = array[index];
        while (cur != null) {
            if (cur.key.equals(key)) {
                return cur.value;
            }
        }
        return null;

    }
}
